Reusing and Modifying Rulebases by Predicate Substitution

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reusing and Modifying Rulebases by Predicate Substitution

We propose a method for reusing and modifying a deductive database. The need for such techniques occurs when new rulebased applications differ only slightly from existing ones or when an application is to be incrementally updated. Such techniques are particularly important when reprogramming is expensive or unreliable. In order to facilitate reuse, we extend deductive database systems by the co...

متن کامل

The Reuse and Modification of Rulebases by Predicate Substituation

We propose a method for reusing and modifying a deductive database. The need for such techniques occurs when new rulebased applications diier only slightly from existing ones or when an application is to be incrementally updated. Such techniques are particularly important when reprogramming is expensive or unreliable. In order to facilitate reuse we extend deductive database systems by the conc...

متن کامل

Reusing (Shrink Wrap) Schemas by Modifying Concept Schemas

We provide mechanisms that facilitate database design based on a shrink wrap schema. A shrink wrap schema is a well-crafted, complete, global schema that represents an application. We develop the notion of concept schemas as a way to decompose shrink wrap schemas. A concept schema is a subset of an application schema that addresses one particular point of view in an application. To aid in shrin...

متن کامل

Nominal Semantics for Predicate Logic: Algebras, Substitution, Quantifiers, and Limits

We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element JaK which is the denotation of the term a (which is also a variable symbol). Similarly, the algebra interpreting predicates in the model directly interprets open predicat...

متن کامل

Uncertainty and RuleML Rulebases: A Preliminary Report

Uncertainty, like imprecision and vagueness, has gained considerable attention the last decade. To this extend we present a preliminary report on extending the Rule Markup Language (RuleML) with fuzzy set theory, in order to be able to represent and handle vague knowledge. We also provide semantics for the case of fuzzy FOL RuleML.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1997

ISSN: 0022-0000

DOI: 10.1006/jcss.1997.1456